An Architecture for Hierarchical Collision Detection

نویسندگان

  • Gabriel Zachmann
  • Günter Knittel
چکیده

We present novel algorithms for efficient hierarchical collision detection and propose a hardware architecture for a single-chip accelerator. We use a hierarchy of bounding volumes defined by k-DOPs for maximum performance. A new hierarchy traversal algorithm and an optimized triangle-triangle intersection test reduce bandwidth and computation costs. The resulting hardware architecture can process two object hierarchies and identify intersecting triangles autonomously at high speed. Real-time collision detection of complex objects at rates required by force-feedback and physically-based simulations can be achieved.

منابع مشابه

High-Performance Collision Detection Hardware

We present a novel hardware architecture for a single-chip collision detection accelerator and algorithms for efficient hierarchical collision. We use a hierarchy of k-DOPs for maximum performance. A new hierarchy traversal algorithm and an optimized triangle-triangle intersection test reduce bandwidth and computational costs. The resulting hardware architecture can process two object hierarchi...

متن کامل

Real-time Robot Arm Collision Detection for Telerobotics

A~tract--The role of real-time collision detection as part of a safety system in telerobotics applications is discussed. We survey a number of proposed collision detection systems. These methods differ in hardware requirements, speed and the information available for use when responding to an immiment collision. In particular, we compare systems based on simulation of the robots' workspace with...

متن کامل

A Combination of Hierarchical Structures and Particle Systems for Self-Collision Detection of Deforming Objects

In this paper, we propose an approach which combines hierarchical structures and particle systems for self-collision detection occurring in a deformable object. Numerous algorithms for collision detection have been proposed in computer graphics applications. Our algorithm exploits the efficiency of hierarchical structures to deal with many polygons, and particle systems because they can be used...

متن کامل

Submitted to Journal of Robotic Systems Distance Maps for Collision Detection

Discretized distance maps have been used in robotics for path planning and eecient collision detection applications in static environments 1]. However, they have been used at the nest level of resolution, thereby making them memory intensive. In this paper, we propose an octree-based hierarchical representation for discretized distance maps, called Octree Distance Maps (ODM), and show its use i...

متن کامل

Collision and Self-Collision Detection :Efficient and Robust Solutions for Highly Deformable Surfaces

We present an efficient algorithm for detecting self collisions, as well as some techniques for evaluating collision inside-outside orientation in a robust way. As presented in [VOL 94], we detect collisions using a hierarchical algorithm that takes advantage of curvature properties giving us full power of hierarchical algorithms for self-collision situations. Determining the collision orientat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003